package DataStructure;


import java.io.*;
import java.util.*;
public class Main {
    private static class ExtremeIO extends PrintWriter{
        private static final BufferedReader br= new BufferedReader(new InputStreamReader(System.in));
        public ExtremeIO() {
            super(new BufferedWriter(new OutputStreamWriter(System.out)));
        }
        public String next() {
            StringBuilder sb = new StringBuilder();
            try {
                int c = br.read();
                while (c <= 32) {
                    c = br.read();
                }
                while (c > 32) {
                    sb.append((char) c);
                    c = br.read();
                }
            }catch (Exception ignored){ }
            return sb.toString();
        }
        public int nextInt(){
            return (int)nextLong();
        }
        public long nextLong(){
            boolean negative = false;
            long x = 0;
            try {
                int c = br.read();
                while (c <= 32) {
                    c = br.read();
                }
                if (c == '-') {
                    negative = true;
                    c = br.read();
                }
                while (c > 32) {
                    x = x * 10 + c - '0';
                    c = br.read();
                }
            }catch (Exception ignored){}
            return negative ? -x : x;
        }
        public double nextDouble() {
            return Double.parseDouble(next());
        }
    }
    private static final ExtremeIO io=new ExtremeIO();
    public static void main(String[] args){
        //时间:O(n!):<10,O(2^n):<20,O(n^3):<200,O(n^2):<5000,O(n*sqrt(n)):<10^5,O(n*log(n)):<10^6,O(n):<10^7
        //空间:128M:int*10^7,512M:int*10^8
        int t=1;
        while(t-->0){ solve(); }
        io.close();
    }
    private static void solve() {


    }
}